On the maximal monotonicity of subdifferential mappings
نویسندگان
چکیده
منابع مشابه
On the maximal monotonicity of diagonal subdifferential operators
Consider a real-valued bifunction f which is concave in its first argument and convex in its second one. We study its subdifferential with respect to the second argument, evaluated at pairs of the form (x, x), and the subdifferential of −f with respect to its first argument, evaluated at the same pairs. The resulting operators are not always monotone, and we analyze additional conditions on f w...
متن کاملPartial second-order subdifferentials of -prox-regular functions
Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2 functions. The class of prox-regular functions covers all convex functions, lower C2 functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...
متن کاملOn the Maximal Dilation of Quasiconformal Mappings
1. Let G and G' be two plane open sets and w(z) a topological map.ping of G onto G'. By Q we denote any quadrilateral in G, i.e. the topological image of a closed square with a distinguished pair of opposite sides. The conformal modulus m of Q is the ratio m=a/b of the sides of a conformally equivalent rectangle 22, the distinguished sides of Q corresponding to the sides of length b. We call th...
متن کاملTechniques for maximal monotonicity
The purpose of this paper is to describe three techniques that are useful for the investigation of monotone sets and multifunctions, and give two applications of them. The three techniques use the “fg–theorem”, the “big convexification” of a subset of E × E∗ or a multifunction E 7→ 2E (we suppose throughout that E is a nontrivial real Banach space with dual E∗), and the “convex function associa...
متن کاملOn limitwise monotonicity and maximal block functions
We prove the existence of a limitwise monotonic function g : N→ N \ {0} such that, for any Π1 function f : N → N \ {0}, Ran f 6= Ran g. Relativising this result we deduce the existence of an η-like computable linear ordering A such that, for any Π2 function F : Q → N \ {0}, and η-like B of order type ∑ {F (q) | q ∈ Q }, B A . We prove directly that, for any computable A which is either (i) stro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1970
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1970.33.209